A lower bound for metric 1-median selection
نویسنده
چکیده
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic o(n 2)-query (4 − Ω(1))-approximation algorithms.
منابع مشابه
A lower bound for 1-median selection in metric spaces
Consider the problem of finding a point in an n-point metric space with the minimum average distance to all points. We show that this problem has no deterministic nonadaptive o(n)-query (4− Ω(1))-approximation algorithms.
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملSelection Algorithms
Given a set X containing n distinct elements, and given a number 1 i n, we would like to nd the element whose rank in X is exactly i, i.e., the element of X larger than exactly i 1 elements of X and smaller than the other n i elements of X. In particular we are interested cases where i = n for some 0 < < 1. The median of X is the dn=2e-th element. Improving a long standing result of Sch onhage...
متن کاملA New Lower Bound for Completion Time Distribution Function of Stochastic PERT Networks
In this paper, a new method for developing a lower bound on exact completion time distribution function of stochastic PERT networks is provided that is based on simplifying the structure of this type of network. The designed mechanism simplifies network structure by arc duplication so that network distribution function can be calculated only with convolution and multiplication. The selection of...
متن کاملA deterministic sublinear-time nonadaptive algorithm for metric 1-median selection
We give a deterministic O(hn1+1/h)-time (2h)-approximation nonadaptive algorithm for 1-median selection in n-point metric spaces, where h ∈ Z+ \ {1} is arbitrary. Our proof generalizes that of Chang [2].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 84 شماره
صفحات -
تاریخ انتشار 2017